Implications of Binding for Lexicalized Grammars
نویسنده
چکیده
Vijay-Shanker and Weir 1990 have shown that the most basic form of Tree-adjoining grammars (TAG) and Combinatory Categorial Grammars (CCG) are weakly equivalent. Nevertheless, actual grammars and analyses for fragments of natural languages in the two frameworks appear very diierent. In particular , in order to capture coordination, unbounded dependency, and intonation structure, CCG and a number of other \\exible" categorial frameworks generalize the notion of surface structure in a way that disrupts traditional notions of dominance and command. This paper shows how incorporating a binding theory into TAG and CCG suggests a uniication of these frameworks , and clariies their relation to ID/LP generalizations of phrase-structure grammars, and to other categorial frameworks that include \wrapping" rules.
منابع مشابه
Extraction of Tree Adjoining Grammars from a Treebank for Korean
We present the implementation of a system which extracts not only lexicalized grammars but also feature-based lexicalized grammars from Korean Sejong Treebank. We report on some practical experiments where we extract TAG grammars and tree schemata. Above all, full-scale syntactic tags and well-formed morphological analysis in Sejong Treebank allow us to extract syntactic features. In addition, ...
متن کاملParsing strategies with 'lexicalized' grammars: application to Tree Adjoining Grammars
In this paper, we present a parsing strategy that arose from the development of an Earley-type parsing algorithm for TAGs (Schabes and Joshi 1988) and from some recent linguistic work in TAGs (Abeillé: 1988a). In our approach, each elementary structure is systematically associated with a lexical head. These structures specify extended domains of locality (as compared to a context-free grammar) ...
متن کاملParsing Techniques for Lexicalized Context-free Grammars
State-of-the art parsers use lexicalized grammars to achieve high accuracy on real-world texts. Most of these systems are based on traditional parsing algorithms that were originally developed for the un-lexicalized versions of the adopted grammar formalisms. We show that these parsing algorithms do not perform eeciently when processing lexicalized grammars. We then develop novel parsing algori...
متن کاملA model of syntactic disambiguation based on lexicalized grammars
This paper presents a new approach to syntactic disambiguation based on lexicalized grammars. While existing disambiguation models decompose the probability of parsing results into that of primitive dependencies of two words, our model selects the most probable parsing result from a set of candidates allowed by a lexicalized grammar. Since parsing results given by the lexicalized grammar cannot...
متن کاملLexicalization and Grammar Development
In this paper we present a fully lexicalized grammar formalism as a particularly attractive framework for the specification of natural language grammars. We discuss in detail Feature-based, Lexicalized Tree Adjoining Grammars (FB-LTAGs), a representative of the class of lexicalized grammars. We illustrate the advantages of lexicalized grammars in various contexts of natural language processing,...
متن کامل